Generalized Version Space Trees
نویسندگان
چکیده
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space trees allow for a comfortable representation of version spaces and a natural way to efficiently process inductive queries and operations on version spaces. In particular, we focus on using generalized version space trees in the field of mining free (i.e. unrooted) trees in graph databases. Experiments with two data sets from the National Cancer Institute’s Developmental Therapeutics Program (DTP) indicate that generalized version space trees can boost inductive queries considerably while featuring moderately increased space requirements in comparison to a version space representation based on boundary sets.
منابع مشابه
On the spectra of reduced distance matrix of the generalized Bethe trees
Let G be a simple connected graph and {v_1,v_2,..., v_k} be the set of pendent (vertices of degree one) vertices of G. The reduced distance matrix of G is a square matrix whose (i,j)-entry is the topological distance between v_i and v_j of G. In this paper, we compute the spectrum of the reduced distance matrix of the generalized Bethe trees.
متن کامل(note) Correctness of Constructing Optimal Alphabetic Trees Revisited
Several new observations which lead to new correctness proofs of two known algorithms (Hu-Tucker and Garsia-Wachs) for construction of optimal alphabetic trees are presented. A generalized version of the Garsia-Wachs algorithm is given. Proof of this generalized version works in a structured and illustrative way and clariies the usually poorly-understood behavior of both the Hu-Tucker and Garsi...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملON COMPACTNESS AND G-COMPLETENESS IN FUZZY METRIC SPACES
In [Fuzzy Sets and Systems 27 (1988) 385-389], M. Grabiec in- troduced a notion of completeness for fuzzy metric spaces (in the sense of Kramosil and Michalek) that successfully used to obtain a fuzzy version of Ba- nachs contraction principle. According to the classical case, one can expect that a compact fuzzy metric space be complete in Grabiecs sense. We show here that this is not the case,...
متن کاملParameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees
The Maximum Agreement Forest problem has been extensively studied in phylogenetics. Most previous work is on two binary phylogenetic trees. In this paper, we study a generalized version of the problem: the Maximum Agreement Forest problem on multiple rooted multifurcating phylogenetic trees, from the perspective of fixed-parameter algorithms. By taking advantage of a new branch-and-bound strate...
متن کامل